FCFS - translation to ρωσικά
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

FCFS - translation to ρωσικά

MATHEMATICAL STUDY OF WAITING LINES, OR QUEUES
Queuing theory; Queuing Theory; First come, first served; Queue theory; Teletraffic queuing theory; Teletraffic Queuing Theory; First-come, first-served; First-come, first-serve; First come, first serve; FCFS; First-come-first-served; Queueing model; Queueing models; Queue (mathematics); Queueing Theory; Queuing model; First-come first-serve; First-come first-served; First come first served; Queuing systems; Arrival rate; Queueing system; Queueing network; QUEUEING THEORY; First come first serve; Stochastic network; Queue Theory; Waiting line theory; Theory of queuing; First Come - First Serve; Reversible queueing system
  • A birth–death process. The values in the circles represent the state of the system, which evolves based on arrival rates ''λ<sub>i</sub>'' and departure rates ''μ<sub>i</sub>''.
  • A black box. Jobs arrive to, and depart from, the queue.
  • First in first out (FIFO) queue example
  • A queueing node with 3 servers. Server '''a''' is idle, and thus an arrival is given to it to process. Server '''b''' is currently busy and will take some time before it can complete service of its job. Server '''c''' has just completed service of a job and thus will be next to receive an arriving job.
  • Queue networks]] are systems in which single queues are connected by a routing network. In this image, servers are represented by circles, queues by a series of rectangles and the routing network by arrows. In the study of queue networks one typically tries to obtain the [[equilibrium distribution]] of the network, although in many applications the study of the [[transient state]] is fundamental.

FCFS         

общая лексика

First Come, First Served

первым пришел - первым обслужен

аббревиатура, используемая в чат-форумах

Смотрите также

digispeak

first-come-first-served         
queuing theory         

общая лексика

теория массового обслуживания

Ορισμός

FCFS

Βικιπαίδεια

Queueing theory

Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.

Queueing theory has its origins in research by Agner Krarup Erlang, who created models to describe the system of incoming calls at the Copenhagen Telephone Exchange Company. These ideas have since seen applications in telecommunication, traffic engineering, computing, project management, and particularly industrial engineering, where they are applied in the design of factories, shops, offices, and hospitals.

Μετάφραση του &#39FCFS&#39 σε Ρωσικά